Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
نویسندگان
چکیده
We present a new general multiparty computation protocol for the cryptographic scenario which is universally composable — in particular, it is secure against an active and adaptive adversary, corrupting any minority of the parties. The protocol is as efficient as the best known statically secure solutions, in particular the number of bits broadcast (which dominates the complexity) is Ω(nk|C|), where n is the number of parties, k is a security parameter, and |C| is the size of a circuit doing the desired computation. Unlike previous adaptively secure protocols for the cryptographic model, our protocol does not use non-committing encryption, instead it is based on homomorphic threshold encryption, in particular the Paillier cryptosystem.
منابع مشابه
On Protocol Security in the Cryptographic Model
It seems to be a generally acknowledged fact that you should never trust a computer and that you should trust the person operating the computer even less. This in particular becomes a problem when the party that you do not trust is one which is separated from you and is one on which you depend, e.g. because that party is the holder of some data or some capability that you need in order to opera...
متن کاملTowards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previously limited to stand-alone and/or honest-but-curious security. In this work, we apply recent results on “non-malleable homomorphic encryption” to construct new protocols with Universally Composable security against ac...
متن کاملExtending a universally composable cryptographic library
Protocol verification is essential to guarantee the security of a certain protocol. For a long time there have been two methods for this job: formal and computational. However, for large and complex protocols we need an automated tool to verify them, because of error-prone nature of manual proofs. Such a tool motivates us to reconcile the two verification approaches. In this paper we define an ...
متن کاملMultiparty Cloud Computation
With the increasing popularity of the cloud, clients oursource their data to clouds in order to take advantage of unlimited virtualized storage space and the low management cost. Such trend prompts the privately oursourcing computation, called multiparty cloud computation (MCC): Given k clients storing their data in the cloud, how can they perform the joint functionality by contributing their p...
متن کاملMultiparty Computation from Threshold Homomorphic Encryption
We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type, general MPC protocols for n players can be devised which are secure against an active adversary that corrupts any minority of the players. The total number of bits sent is O(nk|C|), where k is the security para...
متن کامل